An adaptive two-stage algorithm for ML and sub-ML decoding of binary linear block codes
نویسندگان
چکیده
منابع مشابه
On the Parity-Check Density and Achievable Rates of LDPC Codes for Memoryless Binary-Input Output-Symmetric Channels
We introduce upper bounds on the achievable rates of binary linear block codes under maximum-likelihood (ML) decoding, and lower bounds on the asymptotic density of their parity-check matrices; the transmission of these codes is assumed to take place over an arbitrary memoryless binary-input output-symmetric channel. The bounds hold for every sequence of binary linear block codes. The new bound...
متن کاملMaximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the pr...
متن کاملDecoding Error Probability of Binary Linear Block Codes
The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and outputsymmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ...
متن کاملReduced Complexity Maximum Likelihood Decoding of Linear Block Codes
This paper proposes a reduced complexity Maximum-Likelihood (ML) decoding Algorithm for Linear Block Codes based on the Kaneko decoder and incorporating ruling out conditions for useless iteration steps. The proposed decoding scheme is evaluated over the Additive White Gaussian Noise (AGWN) channel using Binary Phase Shift Key (BPSK) signalling by simulation. Simulations results show that for n...
متن کاملOn the Parity-Check Density and Achievable Rates of LDPC Codes
The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds on the parity-check density are expressed in terms of the gap between the channel capacity and the rate of the codes for which reliable communication is achi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 49 شماره
صفحات -
تاریخ انتشار 2003